Perfect divisibility and 2‐divisibility
نویسندگان
چکیده
منابع مشابه
Perfect divisibility and 2-divisibility
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...
متن کاملDivisibility and State−Complexity
A sequence a = Han L is B−automatic if it can be recognized by a finite state machine in the sense that, on input n, the machine outputs an . Here n is usually written in standard base B notation, though other numeration systems are also considered. A typical example is the Morse−Thue sequence Htn L which is usually defined in terms of iterated morphisms. However, there is an alternative charac...
متن کاملIndivisibility and Divisibility Polytopes
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p | the indivisibility polytopes, as well as the more general \clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.
متن کاملIndefinite Divisibility
Some hold that the lesson of Russell’s paradox and its relatives is that mathematical reality does not form a “definite totality” but rather is “indefinitely extensible”. There can always be more sets than there ever are. I argue that certain contact puzzles are analogous to Russell’s paradox this way: they similarly motivate a vision of physical reality as iteratively generated. In this pictur...
متن کاملPascal’s Triangle and Divisibility
In this chapter we will be investigating the intricacies of a seemingly innocuous mathematical object Pascal’s Triangle. After a brief refresher of our understanding of the triangle, we will delve into Cellular Automata as a method of building patterns, and then relate this to a specific pattern within Pascal’s Triangle. Then we shall investigate specific divisibility identities that can aid in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22367